Edge cycle extendable graphs
نویسنده
چکیده
A graph is edge cycle extendable if every cycle C that is formed from edges and one chord of a larger cycle C is also formed from edges and one chord of a cycle C ′ of length one greater than C with V (C ) ⊆ V (C). Edge cycle extendable graphs are characterized by every block being either chordal (every nontriangular cycle has a chord) or chordless (no nontriangular cycle has a chord); equivalently, every chord of a cycle of length five or more has a noncrossing chord.
منابع مشابه
On Edge-Colored Graphs Covered by Properly Colored Cycles
We characterize edge-colored graphs in which every edge belongs to some properly colored cycle. We obtain our result by applying a characterization of 1-extendable graphs.
متن کاملEdge pair sum labeling of some cycle related graphs
Let G be a (p,q) graph. An injective map f : E(G) → {±1,±2,...,±q} is said to be an edge pair sum labeling if the induced vertex function f*: V (G) → Z - {0} defined by f*(v) = ΣP∈Ev f (e) is one-one where Ev denotes the set of edges in G that are incident with a vertex v and f*(V (G)) is either of the form {±k1,±k2,...,±kp/2} or {±k1,±k2,...,±k(p-1)/2} U {±k(p+1)/2} according as p is even or o...
متن کاملHamiltonian Spider Intersection Graphs Are Cycle Extendable
A cycle C of length k is extendable if there is a cycle C′ of length k+1 with V (C) ⊂ V (C′). A graph G = (V,E) of order n is cycle extendable when every cycle C of length k < n is extendable. A chordal graph is a spider intersection graph if it admits an intersection representation which consists of subtrees of a sub-divided star (or spider). In 1990, Hendry conjectured that all hamiltonian ch...
متن کاملOn the edge-connectivity of C_4-free graphs
Let $G$ be a connected graph of order $n$ and minimum degree $delta(G)$.The edge-connectivity $lambda(G)$ of $G$ is the minimum numberof edges whose removal renders $G$ disconnected. It is well-known that$lambda(G) leq delta(G)$,and if $lambda(G)=delta(G)$, then$G$ is said to be maximally edge-connected. A classical resultby Chartrand gives the sufficient condition $delta(G) geq frac{n-1}{2}$fo...
متن کاملMatching extensions of strongly regular graphs
Let J3 be the number of vertices commonly adjacent to any pair of non-adjacent vertices. It is proved that every strongly regular graph with even order and J3 ~ 1 is l-extendable. We also show that every strongly regular graph of degree at least 3 and cyclic edge connecti vity at least 3k -3 is 2-extendab Ie. Strongly regular graphs of k even order and of degree k at least 3 with J3 ~"3 are 2-e...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Discussiones Mathematicae Graph Theory
دوره 32 شماره
صفحات -
تاریخ انتشار 2012